On Relaxing the Constraints in Pairwise Compatibility Graphs

نویسندگان

  • Tiziana Calamoneri
  • Rossella Petreschi
  • Blerina Sinaimeri
چکیده

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we analyze the class of PCG in relation with two particular subclasses resulting from the the cases where dmin = 0 (LPG) and dmax = +∞ (mLPG). In particular, we show that the union of LPG and mLPG does not coincide with the whole class PCG, their intersection is not empty, and that neither of the classes LPG and mLPG is contained in the other. Finally, as the graphs we deal with belong to the more general class of split matrogenic graphs, we focus on this class of graphs for which we try to establish the membership to the PCG class. keywords: PCG, leaf power graph, threshold graphs, matrogenic graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Not All Graphs are Pairwise Compatibility Graphs

Given an edge weighted tree T and two non-negative real numbers dmin and dmax, a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u ∈ V corresponds to a leaf u of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax in T . Here, dT (u, v) denotes the distance between u and v in T , which is the sum of the weights of the edges on th...

متن کامل

Pairwise Compatibility Graphs

Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two non-negative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u ∈ V corresponds to a leaf u of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dm...

متن کامل

On pairwise compatibility graphs having Dilworth number two

A graph G = (V, E) is called a pairwise compatibility graph (PCG) if there exists a tree T , a positive edge-weight function w on T , and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that V coincides with the set of leaves of T , and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(u, v) ≤ dmax where dT,w(u, v) is the sum of the weights of the edges on the unique path fr...

متن کامل

A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

In this paper we give a necessary condition and a sufficient condition for a graph to be a pairwise compatibility graph (PCG). Let G be a graph and let Gc be the complement of G. We show that if Gc has two disjoint chordless cycles then G is not a PCG. On the other hand, if Gc has no cycle then G is a PCG. Our conditions are the first necessary condition and the first sufficient condition for p...

متن کامل

On Pairwise Compatibility of Some Graph (Super)Classes

A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edgeweighted tree T and two non-negative real numbers dmin and dmax such that each leaf u of T is a node of V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax where dT (u, v) is the sum of weights of the edges on the unique path from u to v in T . The main issue on these graphs consists in charac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012